#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;
using ll = long long;
const int N = 100010;
int n, m, p;
int w[N];
struct Node
{
    int l, r;
    ll sum;
    ll add, mul;
}tr[N * 4];
void eval(Node& t, int add, int mul)
{
    t.sum = (t.sum * mul % p + (ll)(t.r - t.l + 1) * add % p) % p;
    t.mul = t.mul * mul % p;
    t.add = (t.add * mul % p + add) % p;
}
void pushdown(int u)
{
    eval(tr[u << 1], tr[u].add, tr[u].mul);
    eval(tr[u << 1 | 1], tr[u].add, tr[u].mul);
    tr[u].add = 0, tr[u].mul = 1;
}
void pushup(int u)
{
    tr[u].sum = (tr[u << 1].sum + tr[u << 1 | 1].sum) % p;
}
void modify(int u, int l, int r, int add, int mul)
{
    if (tr[u].l >= l && tr[u].r <= r) eval(tr[u], add, mul);
    else
    {
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        if (l <= mid) modify(u << 1, l, r, add, mul);
        if (r > mid) modify(u << 1 | 1, l, r, add, mul);
        pushup(u);
    }
}
int query(int u, int l, int r)
{
    if (tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
    else
    {
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        ll sum = 0;
        if (l <= mid) sum += query(u << 1, l, r);
        if (r > mid) sum = (sum + query(u << 1 | 1, l, r)) % p;
        return sum;
    }
}
void build(int u, int l, int r)
{
    if (l == r) tr[u] = { l,r,w[r],0,1 };
    else
    {
        tr[u] = { l,r,0,0,1 };
        int mid = l + r >> 1;
        build(u << 1, l, mid);
        build(u << 1 | 1, mid + 1, r);
        pushup(u);
    }
}
int main()
{
    cin >> n >> p;
    for (int i = 1; i <= n; i++) cin >> w[i];
    build(1, 1, n);
    cin >> m;
    while (m--)
    {
        int t, l, r, c;
        cin >> t >> l >> r;
        if (t == 1)
        {
            cin >> c;
            modify(1, l, r, 0, c);
        }
        else if (t == 2)
        {
            cin >> c;
            modify(1, l, r, c, 1);
        }
        else cout << query(1, l, r) << endl;
    }
    return 0;
}